Programming complexity

Results: 456



#Item
251Microsoft PowerPoint - cover-IEEE- An Event-model for Constraint-based Person-centric Flows.ppt [Kompatibilitätsmodus]

Microsoft PowerPoint - cover-IEEE- An Event-model for Constraint-based Person-centric Flows.ppt [Kompatibilitätsmodus]

Add to Reading List

Source URL: www.iaas.uni-stuttgart.de

Language: English - Date: 2015-01-26 07:44:58
252Artificial  Intelligence ELSEVIER  Artificial Intelligence[removed]345

Artificial Intelligence ELSEVIER Artificial Intelligence[removed]345

Add to Reading List

Source URL: www.cse.unsw.edu.au

Language: English - Date: 2013-07-29 01:10:58
253Tractable Set Constraints

Tractable Set Constraints

Add to Reading List

Source URL: ijcai.org

Language: English - Date: 2011-06-29 07:09:50
254The Chaos Within Sudoku M´ aria Ercsey-Ravasz1, ∗ and Zolt´an Toroczkai2, 3, † arXiv:1208.0370v1 [nlin.CD] 1 Aug 2012

The Chaos Within Sudoku M´ aria Ercsey-Ravasz1, ∗ and Zolt´an Toroczkai2, 3, † arXiv:1208.0370v1 [nlin.CD] 1 Aug 2012

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2012-08-02 20:18:34
255g05 – Random Number Generators  g05tdc NAG Library Function Document nag_rand_gen_discrete (g05tdc)

g05 – Random Number Generators g05tdc NAG Library Function Document nag_rand_gen_discrete (g05tdc)

Add to Reading List

Source URL: www.nag.com

Language: English - Date: 2012-01-26 06:18:39
256§1. Algorithmics  Lecture I Page 1

§1. Algorithmics Lecture I Page 1

Add to Reading List

Source URL: cs.nyu.edu

Language: English - Date: 2013-04-13 15:02:34
257The Complexity of Reasoning with Global Constraints Christian Bessiere LIRMM, CNRS/U. Montpellier Montpellier, France [removed]

The Complexity of Reasoning with Global Constraints Christian Bessiere LIRMM, CNRS/U. Montpellier Montpellier, France [removed]

Add to Reading List

Source URL: www.cse.unsw.edu.au

Language: English - Date: 2006-09-13 04:55:34
258Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time ∗ arXiv:cs/0111050v7 [cs.DS] 9 Oct[removed]Daniel A. Spielman †

Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time ∗ arXiv:cs/0111050v7 [cs.DS] 9 Oct[removed]Daniel A. Spielman †

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2008-02-01 13:52:50
259The complexity of real recursive functions Manuel Lameiras Campagnolo D.M./I.S.A., Universidade T´ecnica de Lisboa, Tapada da Ajuda, [removed], Lisboa, Portugal; C.L.C./D.M./I.S.T., Universidade T´ecnica de Lisboa, Av.

The complexity of real recursive functions Manuel Lameiras Campagnolo D.M./I.S.A., Universidade T´ecnica de Lisboa, Tapada da Ajuda, [removed], Lisboa, Portugal; C.L.C./D.M./I.S.T., Universidade T´ecnica de Lisboa, Av.

Add to Reading List

Source URL: wslc.math.ist.utl.pt

Language: English - Date: 2003-02-11 11:10:46
260Artificial Intelligence[removed]–156  Decomposable constraints ✩ Ian Gent a , Kostas Stergiou b,∗ , Toby Walsh c a APES Research Group, School of Computer Science, University of St Andrews, Scotland, UK b APE

Artificial Intelligence[removed]–156 Decomposable constraints ✩ Ian Gent a , Kostas Stergiou b,∗ , Toby Walsh c a APES Research Group, School of Computer Science, University of St Andrews, Scotland, UK b APE

Add to Reading List

Source URL: www.cse.unsw.edu.au

Language: English - Date: 2006-01-21 00:51:04